\relax 
\providecommand\zref@newlabel[2]{}
\providecommand\hyper@newdestlabel[2]{}
\@writefile{toc}{\contentsline {chapter}{Appendix Optimization Theory}{71}{appendix*.20}\protected@file@percent }
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{loa}{\addvspace {10\p@ }}
\newlabel{app:optimization}{{D.30.3}{71}{Optimization Theory}{appendix*.20}{}}
\newlabel{app:optimization@cref}{{[subsection][3][0,30]D.30.3}{[1][71][]71}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.31}Convex Optimization Basics}{71}{section.1..31}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.31.1}Convex Optimization Problems}{71}{subsection.1..31.1}\protected@file@percent }
\newlabel{def:convex_optimization}{{.84}{71}{Convex Optimization Problem}{theorem.1..84}{}}
\newlabel{def:convex_optimization@cref}{{[theorem][84][0].84}{[1][71][]71}{}{}{}}
\newlabel{thm:convex_global_optimal}{{.85}{71}{Global Optimality for Convex Problems}{theorem.1..85}{}}
\newlabel{thm:convex_global_optimal@cref}{{[theorem][85][0].85}{[1][71][]71}{}{}{}}
\newlabel{def:feasible_optimal}{{.86}{71}{Feasible Set and Optimal Value}{theorem.1..86}{}}
\newlabel{def:feasible_optimal@cref}{{[theorem][86][0].86}{[1][71][]71}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.31.2}First-Order Conditions}{71}{subsection.1..31.2}\protected@file@percent }
\newlabel{thm:first_order_necessary}{{.87}{71}{First-Order Necessary Conditions}{theorem.1..87}{}}
\newlabel{thm:first_order_necessary@cref}{{[theorem][87][0].87}{[1][71][]71}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.32}KKT Conditions and Duality}{72}{section.1..32}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.32.1}Karush-Kuhn-Tucker Conditions}{72}{subsection.1..32.1}\protected@file@percent }
\newlabel{def:regular_point}{{.88}{72}{Regular Point}{theorem.1..88}{}}
\newlabel{def:regular_point@cref}{{[theorem][88][0].88}{[1][71][]72}{}{}{}}
\newlabel{thm:kkt_conditions}{{.89}{72}{KKT Conditions}{theorem.1..89}{}}
\newlabel{thm:kkt_conditions@cref}{{[theorem][89][0].89}{[1][72][]72}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.32.2}Lagrangian Duality}{72}{subsection.1..32.2}\protected@file@percent }
\newlabel{def:lagrangian_dual}{{.90}{72}{Lagrangian and Dual Function}{theorem.1..90}{}}
\newlabel{def:lagrangian_dual@cref}{{[theorem][90][0].90}{[1][72][]72}{}{}{}}
\newlabel{def:dual_problem}{{.91}{72}{Dual Problem}{theorem.1..91}{}}
\newlabel{def:dual_problem@cref}{{[theorem][91][0].91}{[1][72][]72}{}{}{}}
\newlabel{thm:weak_duality}{{.92}{72}{Weak Duality}{theorem.1..92}{}}
\newlabel{thm:weak_duality@cref}{{[theorem][92][0].92}{[1][72][]72}{}{}{}}
\newlabel{thm:strong_duality}{{.93}{72}{Strong Duality}{theorem.1..93}{}}
\newlabel{thm:strong_duality@cref}{{[theorem][93][0].93}{[1][72][]72}{}{}{}}
\newlabel{def:slater_condition}{{.94}{72}{Slater's Condition}{theorem.1..94}{}}
\newlabel{def:slater_condition@cref}{{[theorem][94][0].94}{[1][72][]72}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.33}Gradient Descent Methods}{72}{section.1..33}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.33.1}Basic Gradient Descent}{72}{subsection.1..33.1}\protected@file@percent }
\newlabel{def:gradient_descent}{{.95}{72}{Gradient Descent Algorithm}{theorem.1..95}{}}
\newlabel{def:gradient_descent@cref}{{[theorem][95][0].95}{[1][72][]72}{}{}{}}
\newlabel{thm:gd_convergence}{{.96}{73}{Convergence of Gradient Descent}{theorem.1..96}{}}
\newlabel{thm:gd_convergence@cref}{{[theorem][96][0].96}{[1][72][]73}{}{}{}}
\newlabel{thm:gd_strong_convex}{{.97}{73}{Convergence for Strongly Convex Functions}{theorem.1..97}{}}
\newlabel{thm:gd_strong_convex@cref}{{[theorem][97][0].97}{[1][73][]73}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.33.2}Accelerated Gradient Methods}{73}{subsection.1..33.2}\protected@file@percent }
\newlabel{def:nesterov}{{.98}{73}{Nesterov's Accelerated Gradient}{theorem.1..98}{}}
\newlabel{def:nesterov@cref}{{[theorem][98][0].98}{[1][73][]73}{}{}{}}
\newlabel{thm:accelerated_convergence}{{.99}{73}{Accelerated Gradient Convergence}{theorem.1..99}{}}
\newlabel{thm:accelerated_convergence@cref}{{[theorem][99][0].99}{[1][73][]73}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.33.3}Stochastic Gradient Descent}{73}{subsection.1..33.3}\protected@file@percent }
\newlabel{def:sgd}{{.100}{73}{Stochastic Gradient Descent}{theorem.1..100}{}}
\newlabel{def:sgd@cref}{{[theorem][100][0].100}{[1][73][]73}{}{}{}}
\newlabel{thm:sgd_convergence}{{.101}{73}{SGD Convergence}{theorem.1..101}{}}
\newlabel{thm:sgd_convergence@cref}{{[theorem][101][0].101}{[1][73][]73}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.34}Submodular Function Theory}{73}{section.1..34}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.34.1}Submodular Functions}{73}{subsection.1..34.1}\protected@file@percent }
\newlabel{def:submodular_function}{{.102}{73}{Submodular Function}{theorem.1..102}{}}
\newlabel{def:submodular_function@cref}{{[theorem][102][0].102}{[1][73][]73}{}{}{}}
\newlabel{def:marginal_gain}{{.103}{73}{Marginal Gain}{theorem.1..103}{}}
\newlabel{def:marginal_gain@cref}{{[theorem][103][0].103}{[1][73][]73}{}{}{}}
\newlabel{thm:submodular_characterizations}{{.104}{74}{Equivalent Characterizations of Submodularity}{theorem.1..104}{}}
\newlabel{thm:submodular_characterizations@cref}{{[theorem][104][0].104}{[1][73][]74}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.34.2}Submodular Maximization}{74}{subsection.1..34.2}\protected@file@percent }
\newlabel{thm:greedy_submodular}{{.105}{74}{Greedy Algorithm for Monotone Submodular Maximization}{theorem.1..105}{}}
\newlabel{thm:greedy_submodular@cref}{{[theorem][105][0].105}{[1][74][]74}{}{}{}}
\newlabel{thm:submodular_hardness}{{.106}{74}{Hardness of Submodular Maximization}{theorem.1..106}{}}
\newlabel{thm:submodular_hardness@cref}{{[theorem][106][0].106}{[1][74][]74}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.34.3}Non-Monotone Submodular Maximization}{74}{subsection.1..34.3}\protected@file@percent }
\newlabel{def:continuous_greedy}{{.107}{74}{Continuous Greedy Algorithm}{theorem.1..107}{}}
\newlabel{def:continuous_greedy@cref}{{[theorem][107][0].107}{[1][74][]74}{}{}{}}
\newlabel{thm:continuous_greedy}{{.108}{74}{Continuous Greedy Performance}{theorem.1..108}{}}
\newlabel{thm:continuous_greedy@cref}{{[theorem][108][0].108}{[1][74][]74}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.35}Multi-Objective Optimization}{74}{section.1..35}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.35.1}Pareto Optimality}{74}{subsection.1..35.1}\protected@file@percent }
\newlabel{def:pareto_dominance}{{.109}{74}{Pareto Dominance}{theorem.1..109}{}}
\newlabel{def:pareto_dominance@cref}{{[theorem][109][0].109}{[1][74][]74}{}{}{}}
\newlabel{def:pareto_optimal}{{.110}{74}{Pareto Optimal Set}{theorem.1..110}{}}
\newlabel{def:pareto_optimal@cref}{{[theorem][110][0].110}{[1][74][]74}{}{}{}}
\newlabel{def:pareto_front}{{.111}{74}{Pareto Front}{theorem.1..111}{}}
\newlabel{def:pareto_front@cref}{{[theorem][111][0].111}{[1][74][]74}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.35.2}Scalarization Methods}{75}{subsection.1..35.2}\protected@file@percent }
\newlabel{def:weighted_sum}{{.112}{75}{Weighted Sum Method}{theorem.1..112}{}}
\newlabel{def:weighted_sum@cref}{{[theorem][112][0].112}{[1][74][]75}{}{}{}}
\newlabel{thm:weighted_sum_pareto}{{.113}{75}{Weighted Sum Pareto Optimality}{theorem.1..113}{}}
\newlabel{thm:weighted_sum_pareto@cref}{{[theorem][113][0].113}{[1][75][]75}{}{}{}}
\newlabel{def:epsilon_constraint}{{.114}{75}{$\epsilon $-Constraint Method}{theorem.1..114}{}}
\newlabel{def:epsilon_constraint@cref}{{[theorem][114][0].114}{[1][75][]75}{}{}{}}
\newlabel{thm:achievement_scalarization}{{.115}{75}{Achievement Scalarization}{theorem.1..115}{}}
\newlabel{thm:achievement_scalarization@cref}{{[theorem][115][0].115}{[1][75][]75}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.36}Applications to Code Intelligence}{75}{section.1..36}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.36.1}Tool Selection as Multi-Objective Optimization}{75}{subsection.1..36.1}\protected@file@percent }
\newlabel{def:code_multi_objective}{{.116}{75}{Code Intelligence Multi-Objective Problem}{theorem.1..116}{}}
\newlabel{def:code_multi_objective@cref}{{[theorem][116][0].116}{[1][75][]75}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.36.2}Context Selection as Submodular Optimization}{75}{subsection.1..36.2}\protected@file@percent }
\newlabel{thm:context_submodularity}{{.117}{75}{Context Selection Submodularity}{theorem.1..117}{}}
\newlabel{thm:context_submodularity@cref}{{[theorem][117][0].117}{[1][75][]75}{}{}{}}
\newlabel{cor:greedy_context}{{.118}{75}{Greedy Context Selection}{theorem.1..118}{}}
\newlabel{cor:greedy_context@cref}{{[theorem][118][0].118}{[1][75][]75}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.36.3}Online Optimization for Dynamic Tool Selection}{75}{subsection.1..36.3}\protected@file@percent }
\newlabel{def:online_tool_selection}{{.119}{75}{Online Convex Optimization for Tool Selection}{theorem.1..119}{}}
\newlabel{def:online_tool_selection@cref}{{[theorem][119][0].119}{[1][75][]75}{}{}{}}
\newlabel{thm:online_tool_regret}{{.120}{76}{Online Tool Selection Regret}{theorem.1..120}{}}
\newlabel{thm:online_tool_regret@cref}{{[theorem][120][0].120}{[1][75][]76}{}{}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E.37}Advanced Topics}{76}{section.1..37}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {E.37.1}Non-Convex Optimization}{76}{subsection.1..37.1}\protected@file@percent }
\newlabel{def:saddle_escape}{{.121}{76}{Escape from Saddle Points}{theorem.1..121}{}}
\newlabel{def:saddle_escape@cref}{{[theorem][121][0].121}{[1][76][]76}{}{}{}}
\newlabel{thm:noisy_gd}{{.122}{76}{Noisy Gradient Descent}{theorem.1..122}{}}
\newlabel{thm:noisy_gd@cref}{{[theorem][122][0].122}{[1][76][]76}{}{}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {E.37.2}Distributionally Robust Optimization}{76}{subsection.1..37.2}\protected@file@percent }
\newlabel{def:dro}{{.123}{76}{Distributionally Robust Problem}{theorem.1..123}{}}
\newlabel{def:dro@cref}{{[theorem][123][0].123}{[1][76][]76}{}{}{}}
\newlabel{thm:wasserstein_dro}{{.124}{76}{Wasserstein DRO Tractability}{theorem.1..124}{}}
\newlabel{thm:wasserstein_dro@cref}{{[theorem][124][0].124}{[1][76][]76}{}{}{}}
\@setckpt{appendices/appendix_e_optimization}{
\setcounter{page}{77}
\setcounter{equation}{160}
\setcounter{enumi}{3}
\setcounter{enumii}{0}
\setcounter{enumiii}{0}
\setcounter{enumiv}{0}
\setcounter{footnote}{0}
\setcounter{mpfootnote}{0}
\setcounter{part}{0}
\setcounter{chapter}{0}
\setcounter{section}{37}
\setcounter{subsection}{2}
\setcounter{subsubsection}{0}
\setcounter{paragraph}{0}
\setcounter{subparagraph}{0}
\setcounter{figure}{0}
\setcounter{table}{0}
\setcounter{parentequation}{0}
\setcounter{AlgoLine}{0}
\setcounter{algocfline}{19}
\setcounter{algocfproc}{19}
\setcounter{algocf}{19}
\setcounter{ALG@line}{0}
\setcounter{ALG@rem}{0}
\setcounter{ALG@nested}{0}
\setcounter{ALG@Lnr}{2}
\setcounter{ALG@blocknr}{10}
\setcounter{ALG@storecount}{0}
\setcounter{ALG@tmpcounter}{0}
\setcounter{lstnumber}{1}
\setcounter{caption@flags}{2}
\setcounter{continuedfloat}{0}
\setcounter{subfigure}{0}
\setcounter{subtable}{0}
\setcounter{LT@tables}{0}
\setcounter{LT@chunks}{0}
\setcounter{tabx@nest}{0}
\setcounter{listtotal}{0}
\setcounter{listcount}{0}
\setcounter{liststart}{0}
\setcounter{liststop}{0}
\setcounter{citecount}{0}
\setcounter{citetotal}{0}
\setcounter{multicitecount}{0}
\setcounter{multicitetotal}{0}
\setcounter{instcount}{1}
\setcounter{maxnames}{3}
\setcounter{minnames}{1}
\setcounter{maxitems}{3}
\setcounter{minitems}{1}
\setcounter{citecounter}{0}
\setcounter{maxcitecounter}{0}
\setcounter{savedcitecounter}{0}
\setcounter{uniquelist}{0}
\setcounter{uniquename}{0}
\setcounter{refsection}{0}
\setcounter{refsegment}{0}
\setcounter{maxextratitle}{0}
\setcounter{maxextratitleyear}{0}
\setcounter{maxextraname}{0}
\setcounter{maxextradate}{0}
\setcounter{maxextraalpha}{0}
\setcounter{abbrvpenalty}{50}
\setcounter{highnamepenalty}{50}
\setcounter{lownamepenalty}{25}
\setcounter{maxparens}{3}
\setcounter{parenlevel}{0}
\setcounter{blx@maxsection}{0}
\setcounter{mincomprange}{10}
\setcounter{maxcomprange}{100000}
\setcounter{mincompwidth}{1}
\setcounter{afterword}{0}
\setcounter{savedafterword}{0}
\setcounter{annotator}{0}
\setcounter{savedannotator}{0}
\setcounter{author}{0}
\setcounter{savedauthor}{0}
\setcounter{bookauthor}{0}
\setcounter{savedbookauthor}{0}
\setcounter{commentator}{0}
\setcounter{savedcommentator}{0}
\setcounter{editor}{0}
\setcounter{savededitor}{0}
\setcounter{editora}{0}
\setcounter{savededitora}{0}
\setcounter{editorb}{0}
\setcounter{savededitorb}{0}
\setcounter{editorc}{0}
\setcounter{savededitorc}{0}
\setcounter{foreword}{0}
\setcounter{savedforeword}{0}
\setcounter{holder}{0}
\setcounter{savedholder}{0}
\setcounter{introduction}{0}
\setcounter{savedintroduction}{0}
\setcounter{namea}{0}
\setcounter{savednamea}{0}
\setcounter{nameb}{0}
\setcounter{savednameb}{0}
\setcounter{namec}{0}
\setcounter{savednamec}{0}
\setcounter{translator}{0}
\setcounter{savedtranslator}{0}
\setcounter{shortauthor}{0}
\setcounter{savedshortauthor}{0}
\setcounter{shorteditor}{0}
\setcounter{savedshorteditor}{0}
\setcounter{labelname}{0}
\setcounter{savedlabelname}{0}
\setcounter{institution}{0}
\setcounter{savedinstitution}{0}
\setcounter{lista}{0}
\setcounter{savedlista}{0}
\setcounter{listb}{0}
\setcounter{savedlistb}{0}
\setcounter{listc}{0}
\setcounter{savedlistc}{0}
\setcounter{listd}{0}
\setcounter{savedlistd}{0}
\setcounter{liste}{0}
\setcounter{savedliste}{0}
\setcounter{listf}{0}
\setcounter{savedlistf}{0}
\setcounter{location}{0}
\setcounter{savedlocation}{0}
\setcounter{organization}{0}
\setcounter{savedorganization}{0}
\setcounter{origlocation}{0}
\setcounter{savedoriglocation}{0}
\setcounter{origpublisher}{0}
\setcounter{savedorigpublisher}{0}
\setcounter{publisher}{0}
\setcounter{savedpublisher}{0}
\setcounter{language}{0}
\setcounter{savedlanguage}{0}
\setcounter{origlanguage}{0}
\setcounter{savedoriglanguage}{0}
\setcounter{pageref}{0}
\setcounter{savedpageref}{0}
\setcounter{textcitecount}{0}
\setcounter{textcitetotal}{0}
\setcounter{textcitemaxnames}{0}
\setcounter{biburlbigbreakpenalty}{100}
\setcounter{biburlbreakpenalty}{200}
\setcounter{biburlnumpenalty}{0}
\setcounter{biburlucpenalty}{0}
\setcounter{biburllcpenalty}{0}
\setcounter{smartand}{1}
\setcounter{bbx:relatedcount}{0}
\setcounter{bbx:relatedtotal}{0}
\setcounter{section@level}{0}
\setcounter{Item}{65}
\setcounter{Hfootnote}{0}
\setcounter{Hy@AnnotLevel}{0}
\setcounter{bookmark@seq@number}{282}
\setcounter{mdf@globalstyle@cnt}{0}
\setcounter{mdfcountframes}{0}
\setcounter{mdf@env@i}{0}
\setcounter{mdf@env@ii}{0}
\setcounter{mdf@zref@counter}{4}
\setcounter{@pps}{1}
\setcounter{@ppsavesec}{7}
\setcounter{@ppsaveapp}{0}
\setcounter{theorem}{124}
\setcounter{lstlisting}{0}
}
